Time- and Space-Efficient Aggregate Range Queries over Encrypted Databases

We present ARQ, a systematic framework for creating cryptographic schemes that handle range aggregate queries (sum, minimum, median, and mode) over encrypted datasets. Our does not rely on trusted hardware or specialized primitives such as property-preserving homomorphic encryption. Instead, ARQ unifies structures from the plaintext data management community with existing structured encryption primitives. prove how combinations yield efficient (and secure) constructions in setting. also propose series of domain reduction techniques can improve space efficiency our against sparse datasets at cost small leakage. As part this work, we designed implemented new, open-source, search library called Arca using order to evaluate ARQ’s practicality. experiments real-world demonstrate derived comparison prior work.